k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh
نویسندگان
چکیده
منابع مشابه
k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh
In this paper we present randomized algorithms for k-k routing, k-k sorting, and cut through routing. The stated resource bounds hold with high probability. The algorithm for k-k routing runs in [k/2]n+o(kn) steps. We also show that k-k sorting can be accomplished within [k/2] n+n+o(kn) steps, and cut through routing can be done in [3/4]kn+[3/2]n+o(kn) steps. The best known time bounds (prior t...
متن کاملk-k Sorting on the Multi-Mesh
We present sorting algorithms on the recently introduced multi-mesh, a network consisting of n 2 meshes of size n n which are connected by the free marginal links of the meshes. Our algorithm takes 41n + o(n) steps which is a signiicant improvement to previously known algorithms. The sorting algorithm is based on a technique using interchange of data between the n n submeshes to distribute info...
متن کامل( ` , k ) - Routing on Plane Grids ∗
The packet routing problem plays an essential role in communication networks. It involves how to transfer data from some origins to some destinations within a reasonable amount of time. In the (`, k)routing problem, each node can send at most ` packets and receive at most k packets. Permutation routing is the particular case ` = k = 1. In the r-central routing problem, all nodes at distance at ...
متن کاملInterval Routing on k-trees
A graph has an optimaì-interval routing scheme if it is possible to direct messages along shortest paths by labeling each edge with at most`pairwise-disjoint subintervals of the cyclic interval 1 : : : n] (where each node of the graph is labeled by an integer in the range). Although much progress has been made for`= 1, there is as yet no general tight characterization of the classes of graphs a...
متن کاملAspects of k-k routing in meshes and OTIS networks
Efficient data transport in parallel computers build on sparse interconnection networks is crucial for their performance. A basic transport problem in such a computer is the k-k routing problem. In this thesis, aspects of the k-k routing problem on r-dimensional meshes and OTIS-G networks are discussed. The first oblivious routing algorithms for these networks are presented that solve the k-k r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 1995
ISSN: 0196-6774
DOI: 10.1006/jagm.1995.1042